|
A Turing tarpit (or Turing tar-pit) is any programming language or computer interface that allows for flexibility in function but is difficult to learn and use because it offers little or no support for common tasks. The phrase was coined in 1982 by Alan Perlis in the ''Epigrams on Programming'': In any Turing complete language, it is possible to write any computer program, so in a very rigorous sense nearly all programming languages are equally capable. Showing that theoretical ability is not the same as usefulness in practice, Turing tarpits are characterized by having a simple abstract machine that requires the user to deal with many details in the solution of a problem.〔(【引用サイトリンク】 title=Exploring the depths of a Turing tarpit )〕 At the extreme opposite are interfaces which can perform very complex tasks with little human intervention but become obsolete if requirements change slightly. Some esoteric programming languages, such as Brainfuck, are specifically referred to as "Turing tarpits" because they deliberately implement the minimum functionality necessary to be classified as Turing complete languages. Using such languages is a form of mathematical recreation: programmers can work out how to achieve basic programming constructs in an extremely difficult but mathematically Turing-equivalent language.〔(Esoteric Topics in Computer Programming ), Cat's Eye Technologies, Canada. (''"They present the programmer with the challenge, intrigue, and entertainment of looking at known algorithms and concepts in a whole new light."'')〕 ==See also== * Gödel numbering * Greenspun's tenth rule * Zawinski's law of software envelopment 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Turing tarpit」の詳細全文を読む スポンサード リンク
|